An Adaptive h-Refinement Algorithm for Local Damage Models
نویسندگان
چکیده
منابع مشابه
An Adaptive h-Refinement Algorithm for Local Damage Models
An adaptive mesh refinement strategy is proposed for local damage models that often arise from internal state variable based continuum damage models. The proposed algorithm employs both the finite element method and the finite difference method to integrate the equations of motion of a linear elastic material with simple isotropic microcracking. The challenges of this problem include the time i...
متن کاملAdaptive $h$-refinement for reduced-order models
This work presents a method to adaptively refine reduced-order models a posteriori without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive h-refinement: it enriches the reduced-basis space online by ‘splitting’ a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via rec...
متن کاملAn Adaptive Local Grid Refinement Method for Nonlinear Filtering
Numerical solution of the Zakai equation usually leads to large systems of equations which have to be solved at each time step. An algorithm for the numerical approximation of the Zakai equation is presented, based on discretization schemes provided by Kushner, and by LeGland. We use an a posteriori criterion based on truncation error, to localize reenement regions. We apply the fast adaptive c...
متن کاملLocal Adaptive Mesh Refinement for Shock Hydrodynamics
The aim of this work is the development of an automatic, adaptive mesh refinement strategy for solving hyperbolic conservation laws in two dimensions. There are two main difficulties in doing this. The first problem is due to the presence of discontinuities in the solution and the effect on them of discontinuities in the mesh. The second problem is how to organize the algorithm to minimize memo...
متن کاملA Local Refinement Algorithm for Data Partitioning
A local reenement method for data partitioning has been constructed. The method balances the workload and minimizes locally the number of edge-cuts. If the initial partitioning is globally good the algorithm converges rapidly with good results. Moreover, the arithmetic complexity of an iteration is very low. The method is well suited for reenement in multilevel partitioning where the intermedia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2009
ISSN: 1999-4893
DOI: 10.3390/a2041281